#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn = 10005;
int marbles[maxn];
int n, q, x, kase;

int main() {
  n = q = kase = 0;
  while ((scanf("%d%d", &n, &q) == 2) && n) {
    printf("CASE# %d:\n", ++kase);

    int i;
    for (i = 0; i < n; i++) {
      scanf("%d", &marbles[i]);
    }

    sort(marbles, marbles + n);
    
    while (q--) {
      scanf("%d", &x);
      int p = lower_bound(marbles, marbles + n, x) - marbles;
      if (marbles[p] == x) {
        printf("%d found at %d\n", x, p + 1);
      }
      else {
        printf("%d not found\n", x);
      }
    }
  }

  return 0;
}
